Optimality and duality for complex multi-objective programming
نویسندگان
چکیده
<p style='text-indent:20px;'>We consider a complex multi-objective programming problem (CMP). In order to establish the optimality conditions of (CMP), we introduce several properties optimal efficient solutions and scalarization techniques. Furthermore, certain parametric dual model is discussed, their duality theorems are proved.</p>
منابع مشابه
Duality of Multi-objective Programming
The convexity theory plays an important role in many aspects of mathematical programming. In recent years, in order to relax convexity assumption, various generalized convexity notions have been obtained. One of them is the concept of ) , ( r p B− invexity defined by T.Antczak [1], which extended the class of B − invex functions with respect toη and b and the classes of ) , ( r p invex function...
متن کاملOptimality and Duality for Non-smooth Multiple Objective Semi-infinite Programming
The purpose of this paper is to consider a class of non-smooth multiobjective semi-infinite programming problem. Based on the concepts of local cone approximation, K − directional derivative and K − subdifferential, a new generalization of convexity, namely generalized uniform ( , , , ) K F d α ρ − − convexity, is defined for this problem. For such semi-infinite programming problem, several suf...
متن کاملOptimality and Duality for an Efficient Solution of Multiobjective Nonlinear Fractional Programming Problem Involving Semilocally Convex Functions
In this paper, the problem under consideration is multiobjective non-linear fractional programming problem involving semilocally convex and related functions. We have discussed the interrelation between the solution sets involving properly efficient solutions of multiobjective fractional programming and corresponding scalar fractional programming problem. Necessary and sufficient optimality...
متن کاملDuality and optimality in multistagestochastic programming
A model of multistage stochastic programming over a scenario tree is developed in which the evolution of information states, as represented by the nodes of a scenario tree, is supplemented by a dynamical system of state vectors controlled by recourse decisions. A dual problem is obtained in which multipliers associated with the primal dynamics are price vectors that are propagated backward in t...
متن کاملInteger Programming Duality in Multiple Objective Programming
The weighted sums approach for linear and convex multiple criteria optimization is well studied. The weights determine a linear function of the criteria approximating a decision makers overall utility. Any efficient solution may be found in this way. This is not the case for multiple criteria integer programming. However, in this case one may apply the more general e-constraint approach, result...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Numerical Algebra, Control and Optimization
سال: 2022
ISSN: ['2155-3297', '2155-3289']
DOI: https://doi.org/10.3934/naco.2021055